Browsing by Subject "Formal logic"

Now showing items 1-20 of 25

    • Conference Object  

      An approach for developing adaptive, mobile applications with separation of concerns 

      Paspallis, Nearchos; Papadopoulos, George Angelos (2006)
      Modern mobile computing paradigms have set new challenges for the development of distributed mobile applications and services. Because of the variability which characterizes the context of such environments, it is important ...
    • Conference Object  

      Argumentation for propositional logic and nonmonotonic reasoning 

      Kakas, Antonis C.; Toni, F.; Mancarella, P. (CEUR-WS, 2014)
      Argumentation has played a significant role in understanding and unifying under a common framework different forms of defeasible reasoning in AI. Argumentation is also close to the original inception of logic as a framework ...
    • Article  

      Argumentation Logic 

      Kakas, Antonis C.; Toni, F.; Mancarella, P. (2014)
      We propose a novel logic-based argumentation framework, called Argumentation Logic (AL), built upon a restriction of classical Propositional Logic (PL) as its underlying logic. This allows us to control the application of ...
    • Article  

      Classical methods in nonmonotonic reasoning 

      Dimopoulos, Yannis (1994)
      In this paper we present and compare some classical problem solving methods for computing the stable models of a general propositional logic program. In particular linear programming, propositional satisfiability, constraint ...
    • Article  

      The computational value of joint consistency 

      Dimopoulos, Yannis (1994)
      In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied ...
    • Conference Object  

      Constraint propagation in propositional planning 

      Sideris, A.; Dimopoulos, Yannis (2010)
      Planning as Satisfiability is a most successful approach to optimal propositional planning. It draws its strength from the efficiency of state-of-the-art propositional satisfiability solvers, combined with the utilization ...
    • Article  

      Crafting the mind of prosocs agents 

      Bracciali, A.; Endriss, U.; Demetriou, Neophytos; Kakas, Antonis C.; Lu, W.; Stathis, Kostas (2006)
      PROSOCS agents are software agents that are built according to the KGP model of agency. KGP is used as a model for the mind of the agent, so that the agent can act autonomously using a collection of logic theories, providing ...
    • Article  

      Distributed and parallel systems engineering in MANIFOLD 

      Papadopoulos, George Angelos (1998)
      A rather recent approach in programming parallel and distributed systems is that of coordination models and languages. Coordination programming enjoys a number of advantages such as the ability to express different software ...
    • Conference Object  

      Heuristic guided optimization for propositional planning 

      Sideris, A.; Dimopoulos, Yannis (AAAI press, 2014)
      Planning as Satisfiability is an important approach to Propositional Planning. A serious drawback of the method is its limited scalability, as the instances that arise from large planning problems are often too hard for ...
    • Conference Object  

      Integer programs and valid inequalities for planning problems 

      Bockmayr, A.; Dimopoulos, Yannis (Springer Verlag, 2000)
      Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinato-rial search problem. The underlying representation language is basically propositional logic. While ...
    • Article  

      IWIM semantics via fibred automata 

      Banach, Richard; Arbab, Farhad; Papadopoulos, George Angelos; Glauert, J. R. W. (2002)
      Coordination programming helps to separate concerns in the programming of the coordination activities in complex applications software. It separates the development, verification, maintenance, and reuse of the coordination ...
    • Article  

      Learning non-monotonic logic programs: Learning exceptions 

      Dimopoulos, Yannis; Kakas, Antonis C. (1995)
      In this paper we present a framework for learning non-monotonic logic programs. The method is parametric on a classical learning algorithm whose generated rules are to be understood as default rules. This means that these ...
    • Article  

      Long-lived Rambo: Trading knowledge for communication 

      Georgiou, Chryssis; Musiał, Peter M.; Shvartsman, A. A. (2007)
      Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with efficiency in practical algorithms is difficult. ...
    • Conference Object  

      Neural network assisted algorithm for automated detection of breast cancer nuclei 

      Tsapatsoulis, Nicolas; Schnorrenberg, Frank; Pattichis, Constantinos S.; Kollias, Stefanos; Schizas, Christos N. (IEEE, 1997)
      A neural network assisted algorithm used for the detection of nuclei in biopsy images is presented in this paper. This algorithm is combined in a logical AND form with an algorithm based on receptive fields to build the ...
    • Article  

      Nonparametric Maximum Entropy 

      Politis, Dimitris Nicolas (1993)
      The standard maximum entropy method of Burg and the resulting autoregressive model has been widely applied for spectrum estimation and prediction. A generalization of the maximum entropy formalism in a nonparametric setting ...
    • Article  

      Object-oriented term graph rewriting 

      Papadopoulos, George Angelos (1999)
      The relationship between the generalised computational model of Term Graph Rewriting Systems (TGRS) and Object-Oriented Programming (OOP) is explored and exploited by extending the TGRS model with records where access to ...
    • Conference Object  

      Position error signal estimation at high sampling rates using data and servo sector measurements 

      Ioannou, Petros A.; Kosmatopoulos, E. B.; Despain, A. M. (2002)
      Track density in hard disk drives (HDD) is related to the performance characteristics of the HDD servo control system. Higher track density can be achieved by improving the performance characteristics of the servo controller ...
    • Conference Object  

      Preferred arguments are harder to compute than stable extensions 

      Dimopoulos, Yannis; Nebel, B.; Toni, F. (1999)
      Based on an abstract framework for nonmonotonic reasoning, Bondarenko et at. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, ...
    • Article  

      A process algebraic framework for modeling resource demand and supply 

      Philippou, Anna; Lee, I.; Sokolsky, O.; Choi, J. -Y (2010)
      As real-time embedded systems become more complex, resource partitioning is increasingly used to guarantee real-time performance. Recently, several compositional frameworks of resource partitioning have been proposed using ...
    • Article  

      Process algebraic modelling and analysis of power-aware real-time systems 

      Lee, I.; Philippou, Anna; Sokolsky, O. (2002)
      A unified formal framework for designing and reasoning about power-constrained, real-time systems is described. The framework is based on process algebra, a formalism that has been developed to describe and analyse ...